Knowledge and Cache based Adaptive Query Searching in Unstructured P2P Networks
نویسندگان
چکیده
Efficient search is a challenging task in unstructured peer-to-peer networks. In this paper, Knowledge and Cache based Adaptive Query Searching (KCAQS) is proposed that adaptively performs a query searching through either directed flooding or biased random walk based on the number of hop counts in query message. In addition, knowledge intended forwarding is deployed for forwarding a query to the high quality peers through probabilistic knowledge predicted from the previously requested queries. Searched results are properly cached in the peers along the returning path. Synchronized caching is performed to properly update the responses of each peer to its connected corresponding high degree connectivity peer in the overlay network. Due to caching of the same files in many peers, most of the cached responses may become redundant. In order to avoid redundant data, cache consistency is sustained through the flexible polling mechanism where a proper cache update is performed through Additive Decrease Multiplicative Increase (ADMI) algorithm based on file utility. Our experimental study shows that the proposed searching scheme significantly reduces the network search traffic and communication overhead. Performance metrics such as success rate, access latency, network traffic response time and cache hit ratio are evaluated for the proposed scheme.
منابع مشابه
An Efficient and Scalable Search Mechanism in Unstructured Peer to Peer Network
Peer-to-peer (P2P) network systems gain a huge popularity due to their scalability and reliability in architectures and search facilities. Basically, most of the real world P2P network is unstructured. Due to their unstructured nature it is often impossible to pre-define the searching criteria. As a solution, flooding scheme is used in most cases. But one major limitation of flooding is its que...
متن کاملDistributed caching in unstructured peer-to-peer file sharing networks
Nowadays, the peer-to-peer (P2P) system is one of the largest Internet bandwidth consumers. To relieve the burden on Internet backbone and improve the query and retrieve performance of P2P file sharing networks, efficient P2P caching algorithms are of great importance. In this paper, we propose a distributed topology-aware unstructured P2P file caching infrastructure and design novel placement ...
متن کاملAn Enhanced Searching Algorithm over Unstructured Mobile P2P Overlay Networks
To discover objects of interest in unstructured peer-to-peer networks, the peers rely on flooding query messages which create incredible network traffic. This article evaluates the performance of an unstructured Gnutella-like protocol over mobile ad-hoc networks and proposes modifications to improve its performance. This paper offers an enhanced mechanism for an unstructured Gnutella-like netwo...
متن کاملEvaluation of Similarity Searching Methods for Music Data in Peer-to-Peer Networks
In this paper, we focus on similarity searching for similar acoustic data over unstructured decentralised P2P networks. Similarity is measured in terms of time warping, which can cope with distortion that is naturally present when query-by-content is performed. We propose a novel framework, which takes advantage of the absence of overhead in unstructured P2P networks and minimises the required ...
متن کاملk-NN Multimedia Retrieval in Unstructured Peer-to-Peer Networks
AbstractRecent years saw the rapid development of peer-to-peer (P2P) networks in a great variety of applications. However, similarity-based k-nearest-neighbor retrieval (k-NN) is still a challenging task in P2P networks due to the multiple constraints such as the dynamic topology and the unpredictable data updates. Caching is an attractive solution that reduces network traffic and hence could r...
متن کامل